Adaptive Hagen–Poiseuille flows on graphs
نویسندگان
چکیده
We derive a class of equations describing low Reynolds number steady flows incompressible and viscous fluids in networks made straight channels, with several sources sinks adaptive conductivities. A graph represents the network, fluxes at control flow. The conductivities describe transverse channel elasticities, mirroring network structures found physics biology. Minimising dissipated energy per unit time, we have an explicit form for adaptation and, asymptotically state tree geometry connecting is reached. phase transition tuned by order parameter adapted has been found.
منابع مشابه
On flows in bidirected graphs
Bouchet conjectured that every bidirected graph which admits a nowhere-zero bidirected flow will admit a nowhere-zero bidirected 6-flow [A. Bouchet, Nowhere-zero integer flows on a bidirected graph, J. Combin. Theory Ser. B 34 (1983) 279–292]. He proved that this conjecture is true with 6 replaced by 216. Zyka proved in his Ph.D dissertation that it is true with 6 replaced by 30. Khelladi prove...
متن کاملOn Circular Flows Of Graphs
A sufficient condition for graphs with circular flow index less than 4 is found in this paper. In particular, we give a simple proof of a result obtained by Galluccio and Goddyn (Combinatorica, 2002), and obtain a larger family of such graphs. We refer readers to [1], [2] and [7] for the standard terminology and notations in this paper. The following theorem was proved by Galluccio and Goddyn. ...
متن کاملStochastic flows on metric graphs
We study a simple stochastic differential equation (SDE) driven by one Brownian motion on a general oriented metric graph whose solutions are stochastic flows of kernels. Under some conditions, we describe the laws of all solutions. This work is a natural continuation of [17, 8, 10] where some particular metric graphs were considered.
متن کاملVector Flows in Graphs and Integer Flows in Signed Graphs
My research focuses on the flow problems consisting of two parts, vector flows in graphs and integer flows in signed graphs. The concept of integer flows was first introduced by Tutte (1949) as a refinement of map coloring. In fact, integer flows is the dual concept of map coloring for planar graphs. This is often referred as duality theorem. Tutte proposed three celebrated flow conjectures whi...
متن کاملNOTE - On circular flows of graphs
Here, we give a simple proof of this theorem without using linear programming. Proof. Since G is 6-edge-connected, by Tutte [5, Theorem 1] or NashWilliams [4, Theorem 1], let T1,T2,T3 be three edge disjoint spanning trees of G. Let Pi be a parity subgraph of Ti (for i=1,2 only). Now fixing some orientation of G. Since P1∪P2 and G\E(P1) are even graphs, let f1 be a nowhere-zero 2-flow with suppo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica D: Nonlinear Phenomena
سال: 2022
ISSN: ['1872-8022', '0167-2789']
DOI: https://doi.org/10.1016/j.physd.2022.133322